Decentralized Auctioneerless Combinatorial Auctions for Multi-Unit Resource Allocation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Multi-attribute Combinatorial Auctions for Resource Allocation

Social concerns about the environment and global warming suggest that industries must focus on reducing energy consumption, due to its social impact and changing laws. Furthermore, the smart grid will bring time-dependent tariffs that pose new challenges to the optimisation of resource allocation. In this paper we address the problem of optimising energy consumption in manufacturing processes b...

متن کامل

An Algorithm for Multi-Unit Combinatorial Auctions

We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously published algorithms are limited to single-unit CAs, already a hard computational problem. In contrast, here we address the more general problem in which each good may have multiple units, and each bid specifies an unr...

متن کامل

Multi-Unit Combinatorial Auctions: an Exact Approach

In recent times combinatorial auctions have become an interesting domain for theoretical and applied developments of the electronic market technology. A combinatorial auction allows the simultaneous selling of several items and each participant to the auction may bid for bundles of items. When items in a bid are all different the auction is said a Single Unit Combinatorial Auction (SUCA), while...

متن کامل

Reverse Combinatorial Auctions for Resource Allocation in the Rescue Scenario

In a disaster environment no single agent knows the disaster situation completely. So, rescue agents share their information in order to identify rescue tasks that are then allocated. In this paper we model the allocation problem as a reverse combinatorial auction and we apply some existing algorithms to solve it. Our results have been compared with the RoboCup classification of 2005.

متن کامل

An Approach to VCG-like Approximate Allocation and Pricing for Large-scale Multi-unit Combinatorial Auctions

A multi-unit combinatorial auction is a combinatorial auction that has some items that can be seen as indistinguishable. Although the mechanism can be applied to dynamic electricity auctions and various purposes, it is difficult to apply to large-scale auction problems due to its computational intractability. In this paper, I present an idea and an analysis about an approximate allocation and p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2019

ISSN: 2169-3536

DOI: 10.1109/access.2019.2922688